'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(1))
Input Problem:    innermost runtime-complexity with respect to
  Rules: {f(s(X), Y) -> h(s(f(h(Y), X)))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {f^#(s(X), Y) -> c_0(f^#(h(Y), X))}
  
  The usable rules are:
   {}
  
  The dependency graph contains no edges.
  
  We are done: the estimated dependency graph contains no edges and moreover, the usable rules are empty.